Post Correspondence Problem for morphisms with unique blocks
نویسندگان
چکیده
In the Post Correspondence Problem (PCP) an instance (h, g) consists of two morphisms h and g, and the problem is to determine whether or not there exists a word w such that h(w) = g(w). Here we prove that the PCP is decidable for instances with unique blocks and that the infinite PCP is decidable for instance with unique continuation in the construction of the solution. These results establish a new larger class of decidable instances of the PCP, including the class of marked instances.
منابع مشابه
Extension of the decidability of the marked PCP to instances with unique blocks
In the Post Correspondence Problem (PCP) an instance (h, g) consists of two morphisms h and g, and the problem is to determine whether or not there exists a nonempty word w such that h(w) = g(w). Here we prove that the PCP is decidable for instances with unique blocks using the decidability of the marked PCP. Also, we show that it is decidable whether an instance satisfying the uniqueness condi...
متن کاملSome New Results on Post Correspondence Problem and Its Modifications
In this work we shall consider some new result on the famous word problem called the Post Correspondence Problem (PCP), initially defined by E. Post. Halava, Hirvensalo and de Wolf [4] proved that the PCP is decidable if we assume that the morphisms are marked. Moreover, Halava, Harju and Hirvensalo [2] proved that even the generalized PCP is decidable in the case of marked morphisms. As a coro...
متن کاملUndecidability of Infinite Post Correspondence Problem for Instances
In the infinite Post Correspondence Problem an instance (h, g) consists of two morphisms h and g, and the problem is to determine whether or not there exists an infinite word ω such that h(ω) = g(ω). This problem was shown to be undecidable by Ruohonen (1985) in general. Recently Blondel and Canterini (Theory Comput. Syst. 36 (2003) 231–245) showed that this problem is undecidable for domain al...
متن کاملRemarks on Generalized Post Correspondence Problem
It is shown that Post Correspondence Problem remains undecidable even in the case where one of the morphisms is xed. Accordingly the generalized PCP is undecidable even in the case where both of the morphisms are xed, and, moreover, the cardinality of their domain alphabet is 7. In particular, GPCP(7) is undecidable. On the other hand, GPCP(2) is not only decidable, but, as we show here, its al...
متن کاملUndecidability of Infinite Post Correspon - dence Problem for Instances of Size 9 TUCS
In the infinite Post Correspondence Problem an instance (h, g) consists of two morphisms h and g, and the problem is to determine whether or not there exists an infinite word ω such that h(ω) = g(ω). This problem was shown to be undecidable by K. Ruohonen (1985) in general. Recently V. D. Blondel and V. Canterini (Theory Comput. Syst. 36, 231–245, 2003) showed that this problem is undecidable f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005